Complementarity for Probabilistic Automata
نویسندگان
چکیده
Motivated by Mermin’s analysis of Einstein-Podolsky-Rosen correlations [25] and [6] we study two computational complementarity principles introduced in [7] for a class of probabilistic automata. We prove the existence of probabilistic automata featuring both types of computational complementarity and we present a method to reduce, under certain conditions, the study of computational complementarity of probabilistic automata to the study of computational complementarity of deterministic automata.
منابع مشابه
Testing Computational Complementarity for Mermin Automata
Mermin [15] described a simple device to explain Einstein-Podolsky-Rosen (EPR) [12] correlations. This device was studied by means of a class of probabilistic (Mermin) automata in [4]. In [5] one shows that every deterministic automaton simulating with confidence 1/2 a probabilistic Mermin automaton features a classical behaviour. Is the above result true when the simulation is done at higher l...
متن کاملA Link Prediction Method Based on Learning Automata in Social Networks
Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...
متن کاملOn the power of parallel communicating Watson-Crick automata systems
Parallel communicating Watson-Crick automata systems were introduced in [2] as possible models of DNA computations. This combination of Watson-Crick automata and parallel communicating systems comes as a natural extension due to the new developments in DNA manipulation techniques. It is already known, see [5], that for Watson-Crick finite automata, the complementarity relation plays no active r...
متن کاملCdmtcs Research Report Series Deterministic Incomplete Automata: Simulation, Universality and Complementarity
We study nite deterministic incomplete automata without initial states. This means that at any stage of a computation there is at most one transition to the next state. We will rst investigate how two incomplete automata can simulate each other. Further on we construct an incomplete automaton which simulates a given automaton S and has the minimum number of states compared to any other automato...
متن کاملMulti-head Watson-Crick automata
Inspired by multi-head finite automata and Watson-Crick automata in this paper, we introduce a new structure namely multi-head Watson-Crick automata where we replace the single tape of multi-head finite automaton by a DNA double strand. The content of the second tape is determined using a complementarity relation similar to Watson-Crick complementarity relation. We establish the superiority of ...
متن کامل